Symbolic Conversion of Holonomic Functions to Hypergeometric Type Power Series
نویسندگان
چکیده
A term an is m-fold hypergeometric, for a given positive integer m, if the ratio $${{a}_{{n + m}}}{\text{/}}{{a}_{n}}$$ rational function over field $$\mathbb{K}$$ of characteristic zero. We establish structure holonomic recurrence equations, i.e. linear and homogeneous equations having polynomial coefficients, that have hypergeometric solutions , any m. Consequently, we describe new algorithm, say mfoldHyper, extends algorithms by Petkovšek (1992) van Hoeij (1998) which compute basis (m = 1) to more general case terms.
منابع مشابه
Holonomic Tools for Basic Hypergeometric Functions
With the exception of q-hypergeometric summation, the use of computer algebra packages implementing Zeilberger’s “holonomic systems approach” in a broader mathematical sense is less common in the field of q-series and basic hypergeometric functions. A major objective of this article is to popularize the usage of such tools also in these domains. Concrete case studies showing software in action ...
متن کاملAlgorithmic determination of q-power series for q-holonomic functions
In [Koepf (1992)] it was shown how for a given holonomic function a representation as a formal power series of hypergeometric type can be determined algorithmically. This algorithm – that we call FPS algorithm (Formal Power Series) – combines three steps to obtain the desired representation. The authors implemented this algorithm in the computer algebra system Maple as c̀onvert/FormalPowerSeries...
متن کاملThree Recitations on Holonomic Systems and Hypergeometric Series
When we teach calculus we have lectures and recitations. These notes are meant as “recitations” or something like “Schaum outlines” for the theory. The role of the “lectures” or “textbook” is provided by Gosper’s path-breaking paper “A Decision Procedure for Indefinite summation”, Proc. Nat. Acad. Sci. USA 75 (1978), 40-42, and by the following papers by myself and my collaborators, Gert Almkvi...
متن کاملA symbolic approach to computing with holonomic functions
In this work we present a symbolic approach to computing with holonomic functions. More precisely, given a function f(x) suspected to be holonomic, we show an algorithm which computes a linear differential equation with polynomial coefficients satisfied by f(x). The algorithm is based on the construction of a suitable context free grammar which lets us compute a nontrivial linear relation for t...
متن کاملDirichlet L-functions, Elliptic Curves, Hypergeometric Functions, and Rational Approximation with Partial Sums of Power Series
We consider the Diophantine approximation of exponential generating functions at rational arguments by their partial sums and by convergents of their (simple) continued fractions. We establish quantitative results showing that these two sets of approximations coincide very seldom. Moreover, we offer many conjectures about the frequency of their coalescence. In particular, we consider exponentia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Programming and Computer Software
سال: 2022
ISSN: ['0361-7688', '1608-3261']
DOI: https://doi.org/10.1134/s0361768822020104